|
|
Path Finding in the Vector Data in OpenStreetMap Project
Adamček, Adam ; Procházka, Boris (referee) ; Váňa, Jan (advisor)
Pathfinding services are nowadays often used by people to plan a route through an unknown area. This bachelor's thesis deals with designing and implementation of an application which is able to search in free map data provided by the OpenStreetMap project and visualize resulting paths. During the search, not only the way types, but the selected transport type and the attributes of the eventual route will be taken into account as well. The work also contains an analysis of the OSM format and the proposal of a custom, more compact format useful for storing the preprocessed data. Eventually, the implemented application's performance is tested and its output is compared with other commonly used routing solutions.
|
|
|
Mobile robot path planning by means of cellular automata
Holoubek, Tomáš ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
This thesis deals with a path planning using cellular automata algorithms in a rectangular grid environment. Theoretical part starts with an overview of commonly used approaches for path planning and later on focuses on existing cellular automata solutions and capabilities in detail. Implemented cellular automata algorithms and the commonly used path planning algorithms are together with a map generator described in the practical part. Conclusion of this thesis contains results completed in a special application.
|
|
|
Search for the Optimal Path in the Terrain
Váňa, Jan ; Janeček, Petr (referee) ; Drahanský, Martin (advisor)
Simulation systems based on artificial intelligence often have to solve the problem of finding a way between two places for an object controlled by a computer. This article deals with a development of such a module for already existing simulation system, which is able to find the best way for any object if this is existent.
|
|
|
Mobile robot path planning by means of cellular automata
Holoubek, Tomáš ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
This thesis deals with a path planning using cellular automata algorithms in a rectangular grid environment. Theoretical part starts with an overview of commonly used approaches for path planning and later on focuses on existing cellular automata solutions and capabilities in detail. Implemented cellular automata algorithms and the commonly used path planning algorithms are together with a map generator described in the practical part. Conclusion of this thesis contains results completed in a special application.
|
|
|
Search for the Optimal Path in the Terrain
Váňa, Jan ; Janeček, Petr (referee) ; Drahanský, Martin (advisor)
Simulation systems based on artificial intelligence often have to solve the problem of finding a way between two places for an object controlled by a computer. This article deals with a development of such a module for already existing simulation system, which is able to find the best way for any object if this is existent.
|
|
|
Path Finding in the Vector Data in OpenStreetMap Project
Adamček, Adam ; Procházka, Boris (referee) ; Váňa, Jan (advisor)
Pathfinding services are nowadays often used by people to plan a route through an unknown area. This bachelor's thesis deals with designing and implementation of an application which is able to search in free map data provided by the OpenStreetMap project and visualize resulting paths. During the search, not only the way types, but the selected transport type and the attributes of the eventual route will be taken into account as well. The work also contains an analysis of the OSM format and the proposal of a custom, more compact format useful for storing the preprocessed data. Eventually, the implemented application's performance is tested and its output is compared with other commonly used routing solutions.
|
guest ::
